URec: a system for unrooted reconciliation

نویسندگان

  • Pawel Górecki
  • Jerzy Tiuryn
چکیده

UNLABELLED URec is a software based on a concept of unrooted reconciliation. It can be used to reconcile a set of unrooted gene trees with a rooted species tree or a set of rooted species trees. Moreover, it computes detailed distribution of gene duplications and gene losses in a species tree. It can be used to infer optimal species phylogenies for a given set of gene trees. URec is implemented in C++ and can be easily compiled under Unix and Windows systems. AVAILABILITY Software is freely available for download from our website at http://bioputer.mimuw.edu.pl/~gorecki/urec. This webpage also contains Windows executables and a number of advanced examples with explanations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inferring phylogeny from whole genomes

MOTIVATION Inferring species phylogenies with a history of gene losses and duplications is a challenging and an important task in computational biology. This problem can be solved by duplication-loss models in which the primary step is to reconcile a rooted gene tree with a rooted species tree. Most modern methods of phylogenetic reconstruction (from sequences) produce unrooted gene trees. This...

متن کامل

Algorithms for Unrooted Gene Trees with Polytomies

Gene tree reconciliation is a method to reconcile gene trees that are confounded by complex histories of gene duplications with a provided species tree. The trees involved are required to be rooted and full binary. Reconciling gene trees allows not only to identify and study such histories for gene families, but is also the base for several higher level applications including the estimation of ...

متن کامل

Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms

Gene tree reconciliation problems invoke the minimum number of evolutionary events that reconcile gene evolution within the context of a species tree. Here we focus on the deep coalescence (DC) problem, that is, given an unrooted gene tree and a rooted species tree, find a rooting of the gene tree that minimizes the number of DC events, or DC cost, when reconciling the gene tree with the specie...

متن کامل

Improving Long Run Marginal Cost based Pricing along with Extended Benefit Factor method for Revenue Reconciliation of Transmission Network in Restructured Power System

Abstract : There are several methods to cover the costs of a transmission system and distribution networks. These methods are divided into either incremental or marginal approaches, which can be either long-term or short-term. The main difference between the incremental and marginal approach is how to calculate the cost of using the network. In the incremental approach, simulation and in the ma...

متن کامل

Archaeal amoA and ureC genes and their transcriptional activity in the Arctic Ocean

Thaumarchaeota and the gene encoding for a subunit of ammonia monooxygenase (amoA) are ubiquitous in Polar Seas, and some Thaumarchaeota also have a gene coding for ureC, diagnostic for urease. Using quantitative PCR we investigated the occurrence of genes and transcripts of ureC and amoA in Arctic samples from winter, spring and summer. AmoA genes, ureC genes and amoA transcripts were always p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Bioinformatics

دوره 23 4  شماره 

صفحات  -

تاریخ انتشار 2007